Co-Clustering Network-Constrained Trajectory Data

نویسندگان

  • Mohamed Khalil El Mahrsi
  • Romain Guigourès
  • Fabrice Rossi
  • Marc Boullé
چکیده

Recently, clustering moving object trajectories kept gaining interest from both the data mining and machine learning communities. This problem, however, was studied mainly and extensively in the setting where moving objects can move freely on the euclidean space. In this paper, we study the problem of clustering trajectories of vehicles whose movement is restricted by the underlying road network. We model relations between these trajectories and road segments as a bipartite graph and we try to cluster its vertices. We demonstrate our approaches on synthetic data and show how it could be useful in inferring knowledge about the flow dynamics and the behavior of the drivers using the road network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph-Based Approaches to Clustering Network-Constrained Trajectory Data

Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network and its influence on evaluating the similarity between trajectories. In this paper, we present an approach to clustering such network-constrained trajectory...

متن کامل

NNCluster: An Efficient Clustering Algorithm for Road Network Trajectories

With the advent of ubiquitous computing, we can easily acquire the locations of moving objects. This paper studies the clustering problem for trajectory data which are constrained by the road network. While many trajectory clustering algorithms have been proposed, they do not consider the spatial proximity over the road network. For such trajectory data, we propose a new distance measure that r...

متن کامل

Spatio-temporal Similarity Measure for Network Constrained Trajectory Data

Trajectory similarity measure is an important issue for analyzing the behavior of moving objects. In this paper, a similarity measure method for network constrained trajectories is proposed. It considers spatial and temporal features simultaneously in calculating spatio-temporal distance. The crossing points of network and semantic information of trajectory are used to extract the characteristi...

متن کامل

Repeated Record Ordering for Constrained Size Clustering

One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...

متن کامل

Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories

In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1511.01281  شماره 

صفحات  -

تاریخ انتشار 2015